Centrality Analysis for Modified Lattices
نویسندگان
چکیده
We derive new, exact expressions for network centrality vectors associated with classical Watts-Strogatz style “ring plus shortcut” networks. We also derive easy-to-interpret approximations that are highly accurate in the large network limit. The analysis helps us to understand the role of the Katz parameter and the PageRank parameter, to compare linear system and eigenvalue based centrality measures, and to predict the behavior of centrality measures on more complicated networks.
منابع مشابه
Vulnerability Analysis of Power Grids Using Modified Centrality Measures
The aim of this paper is to propose modified centrality measures as a tool to identify critical nodes before a vulnerability analysis is performed in an electrical power grid. Pair dependency centrality is weighted using the grid active power flow, and this becomes the basis to define closeness and betweenness of its nodes, and hence to identify the most critical ones. To support the idea of us...
متن کاملAlternative approaches to obtain t-norms and t-conorms on bounded lattices
Triangular norms in the study of probabilistic metric spaces as a special kind of associative functions defined on the unit interval. These functions have found applications in many areas since then. In this study, we present new methods for constructing triangular norms and triangular conorms on an arbitrary bounded lattice under some constraints. Also, we give some illustrative examples for t...
متن کاملReturn probability and k-step measures
The notion of return probability – explored most famously by George Pólya on d-dimensional lattices – has potential as a measure for the analysis of networks. We present an efficient method for finding return probability distributions for connected undirected graphs. We argue that return probability has the same discriminatory power as existing k-step measures – in particular, beta centrality (...
متن کاملCentral points and approximation in residuated lattices
The paper presents results on approximation in residuated lattices given that closeness is assessed by means of biresiduum. We describe central points and optimal central points of subsets of residuated lattices and provide properties of these points. In addition, we present algorithms for two problems regarding optimal approximation.
متن کاملA characterization of multiwavelet packets on general lattices
The objective of this paper is to establish a complete characterization of multiwavelet packets associated with matrix dilation on general lattices $Gamma$ in $mathbb R^d$ by virtue of time-frequency analysis, matrix theory and operator theory.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 38 شماره
صفحات -
تاریخ انتشار 2017